type internal/concurrent.indirect

13 uses

	internal/concurrent (current package)
		hashtriemap.go#L21: 	root     *indirect[K, V]
		hashtriemap.go#L73: 	var i *indirect[K, V]
		hashtriemap.go#L149: func (ht *HashTrieMap[K, V]) expand(oldEntry, newEntry *entry[K, V], newHash uintptr, hashShift uint, parent *indirect[K, V]) *node[K, V] {
		hashtriemap.go#L186: 	var i *indirect[K, V]
		hashtriemap.go#L284: func (ht *HashTrieMap[K, V]) iter(i *indirect[K, V], yield func(key K, value V) bool) bool {
		hashtriemap.go#L318: type indirect[K, V comparable] struct {
		hashtriemap.go#L322: 	parent   *indirect[K, V]
		hashtriemap.go#L326: func newIndirectNode[K, V comparable](parent *indirect[K, V]) *indirect[K, V] {
		hashtriemap.go#L327: 	return &indirect[K, V]{node: node[K, V]{isEntry: false}, parent: parent}
		hashtriemap.go#L330: func (i *indirect[K, V]) empty() bool {
		hashtriemap.go#L403: func (n *node[K, V]) indirect() *indirect[K, V] {
		hashtriemap.go#L407: 	return (*indirect[K, V])(unsafe.Pointer(n))